An axiomatization and a tableau calculus for the logic of comparative concept similarity
نویسندگان
چکیده
Résumé : La logique de similarité comparative des concepts CSL a été introduite en 2005 par Shremet, Tishkowsky, Wolter et Zakharyaschev pour représenter des informations qualitatives sur la similarité entre des concepts, du type “A est plus similaire à B qu’à C”. La sémantique utilise des espaces de distances afin de représenter le degré de similarité entre objets du domaine. Dans cet article, nous étudions CSL sur les minspaces, i.e des espaces de distances dans lesquels tout ensemble de distances possède un minimum, et donnons la première axiomatisation directe de cette logique dans ce contexte, ainsi qu’une méthode de preuve à tableaux. A notre connaissance, notre calcul est la première méthode de preuve pratique pour CSL.
منابع مشابه
Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus. Propositional Linear Temporal Logic (PLTL) is a very popular...
متن کاملTableau calculi for CSL over minspaces
The logic of comparative concept similarity CSL has been introduced in 2005 by Shemeret, Tishkovsky, Zakharyashev and Wolter in order to express a kind of qualitative similarity reasoning about concepts in ontologies. The semantics of the logic is defined in terms of distance spaces; however it can be equivalently reformulated in terms of preferential structures, similar to those ones of condit...
متن کاملHow to Synthesize a Tableau
We synthesize a refutationally complete tableau calculus for propositional logic by a new method, using ordered resolution as a procedural framework at the meta level. Algebraically, the calculus solves the word problem for free distributive lattices. Goal-directedness of the construction is enforced by a ne-tuned well-founded ordering on terms, atoms and clauses. The synthesis is performed in ...
متن کاملDepartment of Computer Science , University of Otago
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after arbitrary announcements. Intuitively, [!]φ expresses that φ is true after an arbitrary announcem...
متن کاملAxiomatization and complexity of modal logic with knowing-what operator on model class K
Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as “knowing whether”, “knowing what”, “knowing how” are frequently and widely used in everyday life as well as academic fields. In [11], an axiomatization of the epistemic logic with both regular “knowing that” operator and “conditionally knowing what” operator is given. Then the decidability and co...
متن کامل